Translating Core Facile

In rst approximation Core Facile is a simply typed-calculus enriched with parallel composition, dynamic channel generation, and input-output synchronous communication primitives. In this paper we explore the (dynamic) semantics of core Facile programs. This should be taken as a basis for the deenition of abstract machines, the transformation of programs, and the development of modal speciication languages. We claim two main contributions. We introduce a new semantics based on the notion of barbed bisimulation. We argue that the derived equivalence provides a more satisfying treatment of restriction, in particular by proving the adequacy of a natural translation of Facile into-calculus we suggest that our approach is in good harmony with previous research on the semantics of sub-calculi of Core Facile such as Chocs and-calculus. We illustrate at an abstract level various aspects of Facile compilation. In particular we introduce anàsynchronous' version of the Facile language, say F a , where asynchrony here means that a process terminates after having performed an output action. We then present an adequate CP S translation from Facile to F a. Moreover we describe an abstract machine which executes code of F a programs. This machine is basically a multiset of environment machines for eager functional evaluation enriched with a mechanism for the dynamic generation of channel names.